MQNA - Markovian Queueing Networks Analyser

نویسندگان

  • Leonardo Brenner
  • Paulo Fernandes
  • Afonso Sales
چکیده

This paper describes the MQNA Markovian Queueing Networks Analyser, a software tool to model and obtain the stationary solution of a large class of Queueing Networks. MQNA can directly solve open and closed product-form queueing networks using classical algorithms. For finite capacity queueing models, MQNA generates Markovian description in the Stochastic Automata Networks (SAN) and Stochastic Petri Nets (SPN) formalisms. Such descriptions can be exported to the PEPS Performance Evaluation of Parallel Systems and SMART Stochastic Model checking Analyzer for Reliability and Timing software tools that can solve SAN and SPN models respectively. In this paper, the MQNA principles and scientific foundations are presented with examples of use, accuracy analysis, and general software characteristics. keywords: performance evaluation software tools, product-form queueing networks, finite capacity queueing networks, stochastic automata networks, stochastic Petri nets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

queueing: A Package For Analysis Of Queueing Networks and Models in R

queueing is a package that solves and provides the main performance measures for both basic Markovian queueing models and single and multiclass product-form queueing networks. It can be used both in education and for professional purposes. It provides an intuitive, straightforward way to build queueing models using S3 methods. The package solves Markovian models of the form M/M/c/K/M/FCFS, open...

متن کامل

Tel Aviv University School of Mathematical Science Asymptotic Methods for Queueing Systems and Networks with Application to Telecommunications

This dissertation is concerned with the study of non-Markovian queueing systems and networks, with applications to communication networks. The main contribution of the dissertation consists in deriving results for non-Markovian networks that have been obtained so far only for Markovian queueing networks. We study large closed client/server communication networks and losses in single-server queu...

متن کامل

Queueing systems and networks . Models and applications

This article describes queueing systems and queueing networks which are successfully used for performance analysis of different systems such as computer, communications, transportation networks and manufacturing. It incorporates classical Markovian systems with exponential service times and a Poisson arrival process, and queueing systems with individual service. Oscillating queueing systems and...

متن کامل

Path-additive Functions in Stochastic Flow Networks with Markovian Routing

1.1. Rationale The Jackson network [1] is a basic model favored as a useful beginning approach to many queueing network problems. Its appeal stems from not only its product-form solution for the joint distribution of the number of customers in each queue but also from the simplicity of the structures of the model. Markovian routing is one such structure. The purpose of this paper is to study so...

متن کامل

Analytic Computation of End-to-end Delays in Queueing Networks with Batch Markovian Arrival Processes and Phase-type Service Times

This paper poposes an analytic approach to compute end-to-end delays in queueing networks composed of BMAP/PH/1 queues. The approximations for the first two moments of the end-to-end delays are based on corresponding moments for the delays at each node in the network. In a traffic-based decomposition of queueing networks, different techniques for the departure process approximation, including t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003